LNCS 7774 - Semantic Technology
نویسندگان
چکیده
We present a polynomial resolution-based decision procedure for the recently introduced description logic ELHOVn( ) , which features nominal schemas as new language construct. Our algorithm is based on ordered resolution and positive superposition, together with a lifting lemma. In contrast to previous work on resolution for description logics, we have to overcome the fact that ELHOVn( ) does not allow for a normalization resulting in clauses of globally limited size.
منابع مشابه
Get My Pizza Right: Repairing Missing is-a Relations in ${\cal ALC}$ Ontologies
With the increased use of ontologies in semantically-enabled applications, the issue of debugging defects in ontologies has become increasingly important. These defects can lead to wrong or incomplete results for the applications. Debugging consists of the phases of detection and repairing. In this paper we focus on the repairing phase of a particular kind of defects, i.e. the missing relations...
متن کاملA Joint Semantic Vector Representation Model for Text Clustering and Classification
Text clustering and classification are two main tasks of text mining. Feature selection plays the key role in the quality of the clustering and classification results. Although word-based features such as term frequency-inverse document frequency (TF-IDF) vectors have been widely used in different applications, their shortcoming in capturing semantic concepts of text motivated researches to use...
متن کاملLipid Nanocapsules for Imatinib Delivery: Design, Optimization and Evaluation of Anticancer Activity Against Melanoma Cell Line
Lipid nanocapsules (LNCs) represent a stable, biocompatible and worthwhile drug delivery system, demonstrating significant potential as gene/drug delivery platforms for cancer therapy. Imatinib, a potent tyrosine kinase inhibitor, has revolutionized the therapy of malignancies resulting from abnormal tyrosine kinase activity. However, its Clinical effectiveness in cancer treatment is h...
متن کاملThe Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson's Arithmetic Q
We will generalize the Second Incompleteness Theorem almost to the level of Robinson’s System Q. We will prove there exists a Π1 sentence V , such that if α is any finite consistent extension of Q+V then α will be unable to prove its Semantic Tableaux consistency. SpringerVerlag LNCS # 1847, 2000, pp. 415–430 (Tableaux 2000 Proc.)
متن کاملAnalysis of User query refinement behavior based on semantic features: user log analysis of Ganj database (IranDoc)
Background and Aim: Information systems cannot be well designed or developed without a clear understanding of needs of users, manner of their information seeking and evaluating. This research has been designed to analyze the Ganj (Iranian research institute of science and technology database) users’ query refinement behaviors via log analysis. Methods: The method of this research is log anal...
متن کامل